package com.study.leetcode;

//https://leetcode-cn.com/problems/next-permutation/
public class Solution_31 {
    public void nextPermutation(int[] nums) {
        int length = nums.length;
        int temp = nums[length - 1];
        int index = length - 1;
//        while (index >= 0 && nums[index] > temp) {
//            index--;
//        }
//        if (index == 0) {
//            for (int i = 0; i < length / 2; i++) {
//                temp = nums[i];
//                nums[i] = nums[length - 1 - i];
//                nums[length - 1 - i] = temp;
//            }
//        } else {
//
//        }
    }
}
